The generalized anti-reflexive solutions for a class of matrix equations (BX = C, XD = E)
نویسندگان
چکیده
منابع مشابه
Anti-reflexive Solutions for a Class of Matrix Equations
In this paper, the generalized anti-reflexive solution for matrix equations (BX = C , XD = E), which arise in left and right inverse eigenpairs problem, is considered. With the special properties of generalized anti-reflexive matrices, the necessary and sufficient conditions for the solvability and a general expression of the solution are obtained. Furthermore, the related optimal approximation...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملThe .p;q/ Generalized Anti-reflexive Extremal Rank Solutions to a System of Matrix Equations
Let n n complex matrices P andQ be nontrivial generalized reflection matrices, i.e., P D P D P 1 ¤ In, Q DQ DQ 1 ¤ In. A complex matrix A with order n is said to be a .P;Q/ generalized anti-reflexive matrix, if PAQ D A. We in this paper mainly investigate the .P;Q/ generalized anti-reflexive maximal and minimal rank solutions to the system of matrix equation AX D B . We present necessary and su...
متن کاملAn Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations
An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...
متن کاملA numerical algorithm for solving a class of matrix equations
In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$ by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Clinics
سال: 2008
ISSN: 1807-0302
DOI: 10.1590/s1807-03022008000100002